Computational complexity theory

Results: 2049



#Item
131Service Retrieval Based on Behavioral Specification and Quality Requirements Daniela Grigori, Veronika Peralta, Mokrane Bouzeghoub PRISM, University of Versailles, France

Service Retrieval Based on Behavioral Specification and Quality Requirements Daniela Grigori, Veronika Peralta, Mokrane Bouzeghoub PRISM, University of Versailles, France

Add to Reading List

Source URL: bpm2005.loria.fr

Language: English - Date: 2005-09-12 10:45:10
132Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2  IIT Delhi, India,

Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India,

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-12-11 12:58:32
133IMMANANTS, TENSOR NETWORK STATES AND THE GEOMETRIC COMPLEXITY THEORY PROGRAM A Dissertation by KE YE

IMMANANTS, TENSOR NETWORK STATES AND THE GEOMETRIC COMPLEXITY THEORY PROGRAM A Dissertation by KE YE

Add to Reading List

Source URL: www.math.tamu.edu

Language: English - Date: 2012-08-31 16:21:03
134Genome Informatics 13: 143–Point Matching Under Non-Uniform Distortions and Protein Side Chain Packing Based on an Efficient

Genome Informatics 13: 143–Point Matching Under Non-Uniform Distortions and Protein Side Chain Packing Based on an Efficient

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2002-12-09 05:53:39
135Microsoft Word - musicExplorerLab.doc

Microsoft Word - musicExplorerLab.doc

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:37:03
136MCS 441 – Theory of Computation I Syllabus Lev Reyzin SpringTime and Location: M-W-F, 12:00-12:50pm, Lincoln Hall (TH) 205

MCS 441 – Theory of Computation I Syllabus Lev Reyzin SpringTime and Location: M-W-F, 12:00-12:50pm, Lincoln Hall (TH) 205

Add to Reading List

Source URL: homepages.math.uic.edu

Language: English - Date: 2016-01-11 11:14:04
137J. EDUCATIONAL COMPUTING RESEARCH, Vol, 2005  SOLVING PROBLEMS REDUCTIVELY MICHAL ARMONI The Open University of Israel and School of Education, Tel-Aviv University

J. EDUCATIONAL COMPUTING RESEARCH, Vol, 2005 SOLVING PROBLEMS REDUCTIVELY MICHAL ARMONI The Open University of Israel and School of Education, Tel-Aviv University

Add to Reading List

Source URL: www.openu.ac.il

Language: English - Date: 2007-10-29 03:55:14
138Automatically Computing Program Path Complexity Lucas Bang, Abdulbaki Aydin, and Tevfik Bultan I. I NTRODUCTION Recent automated software testing techniques focus on achieving path coverage. We present a program complexi

Automatically Computing Program Path Complexity Lucas Bang, Abdulbaki Aydin, and Tevfik Bultan I. I NTRODUCTION Recent automated software testing techniques focus on achieving path coverage. We present a program complexi

Add to Reading List

Source URL: gswc.cs.ucsb.edu

Language: English - Date: 2016-03-01 02:43:37
139De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (extended abstract) Karl Bringmann1 , Tobias Friedrich2 , and Anton Krohmer2 1

De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (extended abstract) Karl Bringmann1 , Tobias Friedrich2 , and Anton Krohmer2 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:27
140Algorithmica: 67–80 DOI: s00453Algorithmica ©

Algorithmica: 67–80 DOI: s00453Algorithmica ©

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2002-07-02 08:00:25